Neighbourhood Broadcasting in Hypercubes
نویسندگان
چکیده
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbour at a time, broadcasting takes at least ⌈log2 N⌉ rounds in a network of N nodes. In the neighbourhood broadcasting problem, the node that is broadcasting only needs to inform its neighbours. In a binary hypercube with N nodes, each node has log2 N neighbours, so neighbourhood broadcasting takes at least ⌈log2 log2(N + 1)⌉ rounds. In this paper, we present asymptotically optimal neighbourhood broadcast protocols for binary hypercubes.
منابع مشابه
Neighborhood Broadcasting in Hypercubes
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbour at a time, broadcasting takes at least "log2 N# rounds in a network of N nodes. In the neighbourhood broadcasting problem, the node that is broadcasting only needs to inform its neighbours. In a binary hypercube with N nodes, each node has log2 N n...
متن کاملTime and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented N node hypercubes. First we generalize a technique, introduced in [3], for partial broadcasting and orientation. Using this technique we develop a broadcasting algorithm on unoriented hypercubes that uses only linear number of bits and runs in optimal time. This gives a positive answer to the question raised in [7] whether O(...
متن کاملNeighbourhood Gossiping in Hypercubes
In the neighbourhood gossiping problem, each node of a network starts with a unique message and must learn the messages of all of its neighbours. In this paper, we prove upper and lower bounds for neighbourhood gossiping in hypercubes under the single-port half-duplex and single-port full-duplex communication models.
متن کاملLinear Broadcasting and N loglog N Election in Unoriented Hypercubes
In this paper, we provide eecient broadcasting and election algorithms in unoriented hypercubes. First, O(N) broadcasting and traversing algorithms are introduced, where N is the number of hy-percube vertices. This answers aarmatively the open question stated in Tel95a] whether linear-message broadcasting and traversing can be achieved on hypercubes without sense of direction. Moreover, by expl...
متن کاملAn Optimal d−1-Fault-Tolerant Broadcasting Scheme for d-Dimensional Hypercubes
Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. We propose a k-fault-tolerant broadcasting scheme for a faulty d-dimensional hypercube where 0≤ k<d. For the whispering model, the new scheme requires 2d time units that are optimal for faulty-hypercubes. Moreover, it onl...
متن کامل